Breaking the barrier of context-freeness
نویسنده
چکیده
This paper presents a generative probabilistic dependency model of parallel texts that can be used for statistical machine translation and parallel parsing. Unlike syntactic models that are based on context-free dependency grammars, the dependency model proposed in this paper is based on a sophisticated notion of dependency grammar that is capable of modelling non-projective word order and island constraints, the complementadjunct distinction, as well as deletions and additions in translations.
منابع مشابه
دینامیک سالیتونهای مدل 6 φ در یک پتانسیل خارجی
In this paper, we study particle aspects of the φ6 kinks in an external potential. The external potential is implemented by breaking the translational invariance of the system. The dynamics of the kink is calculated for the simple harmonic oscillator (SHO) and barrier potentials. The periodic motion of the kink in the SHO case is compared to the corresponding ordinary (classical) motion. It i...
متن کاملExclusion-Freeness in Multi-party Exchange Protocols
In this paper we define a property for multi-party protocols called exclusion-freeness. In multi-party protocols respecting the strongest definition of this property, participants are sure that they will not be excluded from a protocol’s execution and, consequently, they do not have to trust each other any more. We study this property on a wellknown multi-party fair exchange protocol with an on...
متن کاملDeinking of Laser Printed Copy Paper by Chemical Different Treatments and Effect on Optical and Strength Properties of Paper
Paper recycling in an increasingly environmentally conscious world is gaining importance. Withrapid developments in deinking processes for the reuse of secondary fibers being made, therecycling process is become more and more efficient. This work investigated the effect ofchemical different treatments including H2O2 and NaOH on repulping and flotation operationsduring the deinking of laser prin...
متن کاملOptimal bundle pricing for homogeneous items
We consider a revenue maximization problem where we are selling a set of m items, each of which available in a certain quantity (possibly unlimited) to a set of n bidders. Bidders are single minded, that is, each bidder requests exactly one subset, or bundle of items. Each bidder has a valuation for the requested bundle that we assume to be known to the seller. The task is to find an envy-free ...
متن کاملAbout Graph and Hypergraph Context Free Grammars
The main idea of this paper is to show some important differences between graph grammars and hypergraph grammars in context of freeness. On the other hand, we give a possibility to transform the planar structure of a hypergraph into a linear one with concern of determinism. This can create a path to transform a pushdown automaton into a generative grammar equivalent. Key-Words: Hyperedge Replac...
متن کامل